Van Lambalgen's Theorem and High Degrees

نویسندگان

  • Johanna N. Y. Franklin
  • Frank Stephan
چکیده

We show that van Lambalgen’s Theorem fails with respect to recursive randomness and Schnorr randomness for some real in every high degree and provide a full characterization of the Turing degrees for which van Lambalgen’s Theorem can fail with respect to Kurtz randomness. However, we also show that there is a recursively random real that is not Martin-Löf random for which van Lambalgen’s Theorem holds with respect to recursive randomness.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Extension of van Lambalgen's Theorem to Infinitely Many Relative 1-Random Reals

Van Lambalgen’s Theorem plays an important role in algorithmic randomness, especially when studying relative randomness. In this paper we extend van Lambalgen’s Theorem by considering the join of infinitely many reals which are random relative to each other. In addition, we study computability of the reals in the range of Omega operators. It is known that φ ′ is high. We extend this result to ...

متن کامل

Generalization of van Lambalgen's theorem and blind randomness for conditional probability

Lambalgen’s theorem (1987) [6] says that a pair of sequences (x, y) ∈ Ω2 is Martin-Löf (ML) random w.r.t. product of uniform measures iff x is ML-random and y is ML-random relative to x, where Ω is the set of infinite binary sequences. In this paper we give a generalized form of the Lambalgen’s theorem using the notion of blind randomness. Let S be the set of finite binary strings and ∆(s) := {...

متن کامل

Toughness and Vertex Degrees

We study theorems giving sufficient conditions on the vertex degrees of a graph G to guarantee G is t-tough. We first give a best monotone theorem when t ≥ 1, but then show that for any integer k ≥ 1, a best monotone theorem for t = 1 k ≤ 1 requires at least f(k) · |V (G)| nonredundant conditions, where f(k) grows superpolynomially as k → ∞. When t < 1, we give an additional, simple theorem for...

متن کامل

Volumetric properties of high temperature, high pressure supercritical fluids from improved van der Waals equation of state

In the present work, a modified equation of state has been presented for the calculation of volumetric properties of supercritical fluids. The equation of state is van der Waals basis with temperature and density-dependent parameters. This equation of state has been applied for predicting the volumetric properties of fluids. The densities of fluids were calculated from the new equation of state...

متن کامل

Limit distribution of the degrees in scaled attachment random recursive trees

We study the limiting distribution of the degree of a given node in a scaled attachment random recursive tree, a generalized random recursive tree, which is introduced by Devroye et. al (2011). In a scaled attachment random recursive tree, every node $i$ is attached to the node labeled $lfloor iX_i floor$ where $X_0$, $ldots$ , $X_n$ is a sequence of i.i.d. random variables, with support in [0,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Notre Dame Journal of Formal Logic

دوره 52  شماره 

صفحات  -

تاریخ انتشار 2011